TU Dresden

Results: 830



#Item
51

PDF Document

Add to Reading List

Source URL: www.ki.inf.tu-dresden.de

- Date: 2006-03-26 13:42:05
    52TOWARDS PLANNING AS CONCURRENCY Ozan Kahramano˘gulları Computer Science Institute, University of Leipzig International Center for Computational Logic, TU Dresden email:  ABSTRACT

    TOWARDS PLANNING AS CONCURRENCY Ozan Kahramano˘gulları Computer Science Institute, University of Leipzig International Center for Computational Logic, TU Dresden email: ABSTRACT

    Add to Reading List

    Source URL: www.wv.inf.tu-dresden.de

    - Date: 2012-07-05 04:11:43
      53DROPS OS Support for Distributed Multimedia Applications Hermann H¨artig Michael Hohmuth  Robert Baumgartl

      DROPS OS Support for Distributed Multimedia Applications Hermann H¨artig Michael Hohmuth Robert Baumgartl

      Add to Reading List

      Source URL: os.inf.tu-dresden.de

      - Date: 2002-01-04 05:56:43
        54

        PDF Document

        Add to Reading List

        Source URL: www.ki.inf.tu-dresden.de

        - Date: 2006-03-26 13:39:36
          55Statically Checking Confidentiality of Shared-Memory Programs with Dynamic Labels Marcus V¨olp Technische Universit¨at Dresden Department of Computer ScienceDresden, Germany

          Statically Checking Confidentiality of Shared-Memory Programs with Dynamic Labels Marcus V¨olp Technische Universit¨at Dresden Department of Computer ScienceDresden, Germany

          Add to Reading List

          Source URL: os.inf.tu-dresden.de

          - Date: 2008-04-10 10:46:21
            56A Purely Logical Account of Sequentiality in Proof Search Paola Bruscoli Technische Universit¨at Dresden Fakult¨ at InformatikDresden - Germany

            A Purely Logical Account of Sequentiality in Proof Search Paola Bruscoli Technische Universit¨at Dresden Fakult¨ at InformatikDresden - Germany

            Add to Reading List

            Source URL: www.ki.inf.tu-dresden.de

            - Date: 2006-03-26 13:44:36
              57Avoiding Timing Channels in Fixed-Priority Schedulers Marcus Völp, Claude-Joachim Hamann, Hermann Härtig Technische Universität Dresden Department of Computer ScienceDresden

              Avoiding Timing Channels in Fixed-Priority Schedulers Marcus Völp, Claude-Joachim Hamann, Hermann Härtig Technische Universität Dresden Department of Computer ScienceDresden

              Add to Reading List

              Source URL: os.inf.tu-dresden.de

              - Date: 2008-04-10 10:46:22
                58Improving Text Mining with Controlled Natural Language: A Case Study for Protein Interactions Tobias Kuhn1,2 , Lo¨ıc Royer1, Norbert E. Fuchs2 , and Michael Schroeder1 1  Biotechnological Center, TU Dresden, Germany

                Improving Text Mining with Controlled Natural Language: A Case Study for Protein Interactions Tobias Kuhn1,2 , Lo¨ıc Royer1, Norbert E. Fuchs2 , and Michael Schroeder1 1 Biotechnological Center, TU Dresden, Germany

                Add to Reading List

                Source URL: attempto.ifi.uzh.ch

                - Date: 2013-09-23 06:46:42
                  59

                  PDF Document

                  Add to Reading List

                  Source URL: tu-dresden.de

                    60

                    PDF Document

                    Add to Reading List

                    Source URL: www.ki.inf.tu-dresden.de

                    - Date: 2006-03-26 13:38:23